Partitioned-Tree Nested Loop Join: An Efficient Join for Spatio-Temporal Interval Join
نویسندگان
چکیده
منابع مشابه
Spatio-temporal join selectivity
Given two sets S1, S2 of moving objects, a future timestamp tq, and a distance threshold d, a spatio-temporal join retrieves all pairs of objects that are within distance d at tq. The selectivity of a join equals the number of retrieved pairs divided by the cardinality of the Cartesian product S1 S2. This paper develops a model for spatio-temporal join selectivity estimation based on rigorous p...
متن کاملOn Spatially Partitioned Temporal Join
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to points in a two dimensional space and partitions the space into subspaces. Tupies of a temporal relation are clustered into partitions based on the mapping in the space. As a result, when two temporal relations are to ...
متن کاملSkyline Evaluation Within Join Operation, Block Nested Loop Join Implementation
Skyline Join approach in its Naïve age work as it computes join first and then apply skyline computation to find corresponding skyline objects. Considering increase in cardinality and dimensionality of join table the cost of computing skyline in a non-reductive join relation is costlier than that of on single table. Most of the existing work on skyline queries for databases mainly discusses the...
متن کاملScheduling Issues in Partitioned Temporal Join
A list of technical reports, including some abstracts and copies of some full reports may be found at: Abstract One of the major problems of temporal databases is to develop eecient algorithms for operations that involves the time attributes. An operation that has received much attention in recent years is the temporal join which matches records from two temporal relations whose time intervals ...
متن کاملEfficient Similarity Join of Large Sets of Spatio-temporal Trajectories
We address the problem of performing efficient similarity join for large sets of moving objects trajectories. Unlike previous approaches which use a dedicated index in a transformed space, our premise is that in many applications of location-based services, the trajectories are already indexed in their native space, in order to facilitate the processing of common spatio-temporal queries, e.g., ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2013
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e96.d.1206